Tim Roughgarden - PDFSEARCH.IO - Document Search Engine

Tim Roughgarden
Results: 191

#	Item
121	CS168: The Modern Algorithmic Toolbox Lecture #7: Understanding and Using Principal Component Analysis (PCA) Tim Roughgarden & Gregory Valiant∗ April 18, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-06-04 09:49:44 Multivariate statistics Dimension reduction Abstract algebra Linear algebra Analytic geometry Principal component analysis Dimensionality reduction Eigenvalues and eigenvectors Linear regression Euclidean vector Degrees of freedom Eigenface
122	CS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes Tim Roughgarden & Gregory Valiant∗ June 1, 2016 In the first lecture of CS168, we talked about modern techniques in data storage (consistent hashing). S Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-06-04 09:49:43 Coding theory Error detection and correction Expander code Expander graph Linear code Hamming Isoperimetric inequality Connectivity Clique Forward error correction Graph Bipartite graph
123	CS364A: Algorithmic Game Theory Lecture #7: Multi-Parameter Mechanism Design and the VCG Mechanism∗ Tim Roughgarden† October 14, 2013 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-09-22 16:31:05 Auction theory Mechanism design Game theory Auctions Vickrey auction VickreyClarkeGroves mechanism VickreyClarkeGroves auction Auction Single-parameter utility English auction Revelation principle Spectrum auction
124	Minimizing Regret with Multiple Reserves TIM ROUGHGARDEN, Stanford University JOSHUA R. WANG, Stanford University We study the problem of computing and learning non-anonymous reserve prices to maximize revenue. We first Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2016-08-08 16:20:04 Auction theory Mechanism design Auctions Game theory Vickrey auction VickreyClarkeGroves auction Auction VickreyClarkeGroves mechanism Matroid Linear programming Random-sampling mechanism
125	CS264: Beyond Worst-Case Analysis Lecture #5: Computing Independent Sets: A Parameterized Analysis ∗ Tim Roughgarden† October 8, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-02 12:35:58 NP-complete problems Approximation algorithm Independent set Algorithm Maximal independent set Longest path problem Vertex cover
126	CS261: A Second Course in Algorithms Lecture #10: The Minimax Theorem and Algorithms for Linear Programming∗ Tim Roughgarden† February 4, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-14 14:14:35 Operations research Linear programming Convex optimization Combinatorial optimization Mathematical optimization Simplex algorithm Ellipsoid method Simplex Candidate solution Nonlinear programming Minimax Optimization problem
127	Lo al Smoothness and the Pri e of Anar hy in Splittable Congestion Games∗ Tim Roughgarden † Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2013-05-02 15:58:33 Game theory Congestion game Nash equilibrium
128	CS364A: Algorithmic Game Theory Lecture #9: Beyond Quasi-Linearity∗ Tim Roughgarden† October 21, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-09-22 16:32:41 Auction theory Auctions Game theory Mechanism design Auction Vickrey auction VickreyClarkeGroves auction Multiunit auction English auction Bidding VickreyClarkeGroves mechanism Sequential auction
129	CS168: The Modern Algorithmic Toolbox Lecture #3: Similarity Metrics and kd-Trees Tim Roughgarden & Gregory Valiant April 6, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-06-04 09:49:43 Metric geometry Length Multivariate statistics Statistical distance Search algorithms Jaccard index Similarity Metric Cosine similarity K-d tree K-nearest neighbors algorithm Euclidean distance
130	CS369E: Communication Complexity (for Algorithm Designers) Lecture #7: Lower Bounds in Algorithmic Game Theory∗ Tim Roughgarden† March 5, 2015 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-09-14 17:18:05 Game theory Computational complexity theory Quantum complexity theory Complexity classes Decision theory Nash equilibrium Price of anarchy Exponential time hypothesis Circuit complexity Communication complexity Algorithmic game theory PP

UPDATE